A Sequence of Triangle-Free Pseudorandom Graphs
نویسنده
چکیده
A construction of Alon yields a sequence of highly pseudorandom triangle-free graphs with edge density significantly higher than one might expect from comparison with random graphs. We give an alternative construction for such graphs.
منابع مشابه
Powers of Hamilton Cycles in Pseudorandom Graphs
We study the appearance of powers of Hamilton cycles in pseudorandom graphs, using the following comparatively weak pseudorandomness notion. A graph G is (ε, p, k, l)-pseudorandom if for all disjoint X and Y ⊆ V (G) with |X| ≥ εpkn and |Y | ≥ εpln we have e(X,Y ) = (1± ε)p|X||Y |. We prove that for all β > 0 there is an ε > 0 such that an (ε, p, 1, 2)-pseudorandom graph on n vertices with minim...
متن کاملAnother Infinite Sequence of Dense Triangle-Free Graphs
The core is the unique homorphically minimal subgraph of a graph A triangle free graph with minimum degree n is called dense It was observed by many authors that dense triangle free graphs share strong structural properties and that the natural way to describe the structure of these graphs is in terms of graph homomorphisms One in nite sequence of cores of dense maximal triangle free graphs was...
متن کاملOn the Triangle Removal Lemma for Subgraphs of Sparse Pseudorandom Graphs
We study an extension of the triangle removal lemma of Ruzsa and Szemerédi [Triple systems with no six points carrying three triangles, Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. II, NorthHolland, Amsterdam, 1978, pp. 939–945], which gave rise to a purely combinatorial proof of the fact that sets of integers of positive upper density contain three-term arithmetic progr...
متن کاملLong heterochromatic paths in heterochromatic triangle free graphs ∗
In this paper, graphs under consideration are always edge-colored. We consider long heterochromatic paths in heterochromatic triangle free graphs. Two kinds of such graphs are considered, one is complete graphs with Gallai colorings, i.e., heterochromatic triangle free complete graphs; the other is heterochromatic triangle free graphs with k-good colorings, i.e., minimum color degree at least k...
متن کاملA constructive characterization of 3-connected triangle-free graphs
We present a method to construct the class C of the finite simple 3-connected triangle free graphs from the 3-regular complete bipartite graph K 3,3 and the skeleton of a 3-dimensional cube by sequentially applying one of five operations, without leaving C in the intermediate steps. Each of these operations can be considered as a sequence of at most six vertex splittings and edge additions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 26 شماره
صفحات -
تاریخ انتشار 2017